搜索资源列表
-
1下载:
输入一个正则表达式,可以使用: 小写字母或数字,表示终结符;*,闭包;+,并集;~,补集;E,空串;O,空集 然后程序将生成 相应的NFA,以及化简之后的DFA,最后再输入一个字符串,程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end; * Closure; , And set; To complement the set; E, empty
-
-
0下载:
1.输入文件解析
2.正则表达式转化为NFA
3.多个NFA合并
4.NFA转换DFA
5代码生成
关于输入文件格式:
没有考虑对lex输入文件的出错处理,所以输入文件务必严格书写正确。
Lex中的正规表达式使用了以下运算符:
[] | * @ ( )
并且正规表达式中不能出现其他的子正规表达式。
如果想要在待识别的正则式中使用上述运算符,请使用转义符号,即\。
例如,如果想用*,可以写成\*
,1. Analysis of the input file 2.
-
-
0下载:
输入一个正则表达式,输出相应的NFA图,NFA转换为DFA(得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图),DFA最小化(也要求用画图方法完成)
-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first
-
-
0下载:
正则表达式转DFA,设计原理:1正则表达式转换为带ε的NFA(Thompson构造法);2ε-NFA转为DFA;3最小化DFA;4DFA状态转换表判断是否接受输入字符串,附有详细文档说明。-Regular expressions turn DFA, design principles: a regular expression is converted to ε of the NFA (Thompson Construction Law) 2ε-NFA to DFA 3 minimal DF
-
-
0下载:
编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过,都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors
-
-
0下载:
输入正则表达式,转化为NFA,DFA,从测试文档中找出最大匹配子串-Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring
-
-
0下载:
Lex输入文件的解析
正规表达式的解析
一个正规表达式到NFA的转换算法的实现-Analysis of the Lex input file of regular expressions to resolve a formal expression to NFA conversion algorithm
-
-
0下载:
正则表达式->NFA/DFA/最简表达式-Regular Expression-> NFA/DFA/the most simple expression
-
-
0下载:
用c++实现的此法分析器,包括正则表达式解析,正则到NFA转换,NFA到DFA转换,和最终的匹配,详见包中README文件-Using c++ parser to achieve this method, including regular expression analysis, while the NFA is converted, NFA to DFA conversion, and end the match, see the package README file
-
-
0下载:
source for conversion of regular expression to NFA in compilers.
-
-
0下载:
graphic Automaton simulator,NFA to DFA conversion and minimisation
-
-
0下载:
A Program that can convert your Regular Expression to PostFix Post_Fix to NFA [Thomson s Construction] NFA to DFA [Subset Construction] DFA to minDFA [Table Filling Algorithm]
-
-
0下载:
Regular expression to e-nfa
-
-
0下载:
regular expression转换为NFA
NFA转换到regular expression
包含设计说明文档、可执行程序、源代码等;清晰明了;
用java编写;-regular expression into NFA
NFA transition to regular expression
Includes design documentation, executable programs, source code, etc. clarity
Writ
-
-
1下载:
手工构造一个能够识别C语言的所有典型单词,如:标识符、数字、运算符,和if、while等保留字的确定有限自动机,并写出对应该自动机的程序;然后以一个简化的C语言程序为输入文件,通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表,并以文件形式保存结果(也就是TOKEN序列)。
将自己定义的各个正则表达式转化为NFA,然后将其综合为NFA ,再将NFA 转化为DFA,再将DFA转化为最少状态的DFA ,最后由DFA 转化为词法分析程序。-Manually constr
-
-
0下载:
正则表达式转NFA NFA转DFA DFA最小化
测试字符串是否匹配-Transfer NFA NFA regular expression to minimize transfer DFA DFA test whether the string matches
-
-
0下载:
This program is used to covert regular expression into NFA in compiler design.
-
-
0下载:
Regular expression to NFA states.
-
-
0下载:
实验正则表达式到NFA
由NFA到DFA,同时有状态表的生成-Experimental regular expression to NFA
From NFA to DFA, while the state table generation
-
-
0下载:
编译原理实验正则表达式到NFA
由NFA到DFA,同时有状态表的生成-Experimental regular expression to NFA
From NFA to DFA, while the state table generation
-